Monge matrices make maximization manageable

We continue the research on the eeects of Monge structures in the area of combinatorial optimization. We show that three optimization problems become easy if the underlying cost matrix fulllls the Monge property: (A) The balanced max{cut problem, (B) the problem of computing minimum weight binary k-matchings and (C) the computation of longest paths in bipartite, edge-weighted graphs. In all three results, we rst prove that the Monge structure imposes some special combinato-rial property on the structure of the optimum solution, and then we exploit this combinatorial property to derive eecient algorithms.